A Particle Swarm Optimization Based Chaotic K-means Evolutionary Approach
نویسندگان
چکیده
The proposed approach brings up a manner of cognitiveness that inherits a paradigm in particle swarm optimization to implement a chaotic mapping and enhanced by K-means clustering algorithm. In this work, named KCPSO, chaotic mapping with ergodicity, irregularity and the stochastic properties in PSO contributes to global search while K-means with clustering properties in PSO results in rapid convergence. Numerical results indicated that PSO adopting chaotic features can more easily escape from local optima, and meanwhile PSO incorporating with K-means can evidently improve convergence speed. Unpredictability and grouping principle underlying chaotic mapping and K-means methods often imply diversity maintenance and convergence potential within the swarm which inevitably lead to a desirable optimal solution. As proven in the experiments with multidimensional search space and compared with original PSO, the conclusions reported that the proposed KCPSO algorithm could improve the search performance on the benchmark functions significantly, and show the effectiveness of solving optimization problems.
منابع مشابه
Non-linear Fractional-Order Chaotic Systems Identification with Approximated Fractional-Order Derivative based on a Hybrid Particle Swarm Optimization-Genetic Algorithm Method
Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملGENERALIZED FLEXIBILITY-BASED MODEL UPDATING APPROACH VIA DEMOCRATIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR STRUCTURAL DAMAGE PROGNOSIS
This paper presents a new model updating approach for structural damage localization and quantification. Based on the Modal Assurance Criterion (MAC), a new damage-sensitive cost function is introduced by employing the main diagonal and anti-diagonal members of the calculated Generalized Flexibility Matrix (GFM) for the monitored structure and its analytical model. Then, ...
متن کاملParticle Swarm Optimization Approach for Multi-step-ahead Prediction Using Radial Basis Function Neural Network
An alternative approach, between much others, for mathematical representation of dynamics systems with complex or chaotic behaviour, is a radial basis function neural network using k-means for clustering and optimized by pseudo-inverse and particle swarm optimisation. This paper presents the implementation and study to identify a dynamic system, with nonlinear and chaotic behaviour, called Röss...
متن کاملAccelerated Chaotic Particle Swarm Optimization for Data Clustering
Data clustering is a powerful technique for discerning the structure of and simplifying the complexity of large scale data. An improved technique combining chaotic map particle swarm optimization (CPSO) with an acceleration strategy, is proposed in this paper. Accelerated chaotic particle swarm optimization (ACPSO) searches for cluster centers of an arbitrary data set and can effectively find t...
متن کامل